P is not equal to NP
نویسنده
چکیده
SAT is not in P is proved, in a first-order theory, with a new single finite axiom of Turing’s theory of computing. So, P is not equal to NP.
منابع مشابه
P is not equal to NP
A new axiom of Turing’s theory of computing is used to prove that SAT is not in P. Thus, P is not equal to NP, follows directly. A computeroriented version verifies the results, elsewhere, using a theorem-prover.
متن کاملPhilosophical Solution to P=?NP: P is Equal to NP
The P=?NP problem is philosophically solved by showing P is equal to NP in the random access with unit multiply (MRAM) model. It is shown that the MRAM model empirically best models computation hardness. The P=?NP problem is shown to be a scientific rather than a mathematical problem. The assumptions involved in the current definition of the P?=NP problem as a problem involving non deterministi...
متن کاملDoes NP not equal P ? C
— Stephen Cook posited SAT is NP-Complete in 1971. If SAT is NP-Complete then, as is generally accepted, any polynomial solution of it must also present a polynomial solution of all NP decision problems. It is here argued, however, that NP is not of necessity equivalent to P, were it shown that SAT is contained in P. This due to a paradox, of nature addressed by both Gödel and Russell, in regar...
متن کاملP = Np
The question of whether the class of decision problems that can be solved by deterministic polynomial-time algorithms (P ) is equal to the class of decision problems that can be solved by nondeterministic polynomial-time algorithms (NP) has been open since it was first formulated by Cook, Karp, and Levin in 1971. In this paper, we prove that they are not equal by showing that any algorithm that...
متن کاملP is not equal to NP by Modus Tollens
An artificially designed Turing Machine algorithm Mo generates the instances of the satisfiability problem, and check their satisfiability. Under the assumption P = NP , we show that Mo has a certain property, which, without the assumption, Mo does not have. This leads to P 6= NP by
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره cs.CC/0305035 شماره
صفحات -
تاریخ انتشار 2003